Building mixture trees from binary sequence data

نویسنده

  • B SHU-CHUAN CHEN
چکیده

We develop a new method for building a hierarchical tree from binary sequence data. It is based on an ancestral mixture model. The sieve parameter in the model plays the role of time in the evolutionary tree of the sequences. By varying the sieve parameter, one can create a hierarchical tree that estimates the population structure at each fixed backward point in time. Application to the clustering of the mitochondrial  sequences of Griffiths & Tavaré (1994) shows that the approach performs well. Theoretical and computational properties of the ancestral mixture model are further developed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree-Combined Trie: A Compressed Data Structure for Fast Ip Address Lookup

For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new ...

متن کامل

Building Optimal Binary Search Trees from Sorted Values in O(N) Time

First, we present a simple algorithm which, given a sorted sequence of node values, can build a binary search tree of minimum height in O(N) time. The algorithm works with sequences whose length is, a priori, unknown. Previous algorithms [1-3] required the number of elements to be known in advance. Although the produced trees are of minimum height, they are generally unbalanced. We then show ho...

متن کامل

A top-down method for building genome classification trees with linear binary hierarchies

With complete genome sequence data becoming available at an increasing rate, the problem of classification of the genomes on the basis of different criteria is becoming pressing. Here we present an approach that applies linear embedding of binary hierarchies to the analysis of the representation of genomes in clusters of orthologs. Rather than imposing an evolutionary postulate such as the addi...

متن کامل

Evolving Guide Trees in Progressive Multiple Sequence Alignment

We present a novel application of genetic algorithms to the problem of aligning multiple biological sequences through the optimization of guide trees. Individual guide trees are represented as coalescing binary trees which provide for efficient and meaningful crossover and mutation operations. We hypothesize that our technique avoids the limitations of other heuristic tree-building techniques, ...

متن کامل

Seismic Data Forecasting: A Sequence Prediction or a Sequence Recognition Task

In this paper, we have tried to predict earthquake events in a cluster of seismic data on pacific ring of fire, using multivariate adaptive regression splines (MARS). The model is employed as either a predictor for a sequence prediction task, or a binary classifier for a sequence recognition problem, which could alternatively help to predict an event. Here, we explain that sequence prediction/r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006